-
1 поиск с возвратом
( в направлении исходной точки) backtracking searchРусско-английский словарь по электронике > поиск с возвратом
-
2 поиск с возвратом
( в направлении исходной точки) backtracking searchРусско-английский словарь по радиоэлектронике > поиск с возвратом
См. также в других словарях:
Backtracking — is a type of algorithm that is a refinement of brute force search. [cite web | url=http://www.cse.ohio state.edu/ gurari/course/cis680/cis680Ch19.html#QQ1 51 128 Backtracking algorithms | title=CIS 680: DATA STRUCTURES: Chapter 19: Backtracking… … Wikipedia
Search algorithm — In computer science, a search algorithm, broadly speaking, is an algorithm that takes a problem as input and returns a solution to the problem, usually after evaluating a number of possible solutions. Most of the algorithms studied by computer… … Wikipedia
Backtracking line search — In (unconstrained) optimization, the backtracking linesearch strategy is used as part of a linesearch method, to compute how far one should move along a given search direction.MotivationUsually it is undesirable to exactly minimize the function… … Wikipedia
Depth-first search — Order in which the nodes are visited Class Search algorithm Data structure Graph Worst case performance … Wikipedia
Beam stack search — is a search algorithm which integrates backtracking with beam search.It was recently proposed by Rong Zhou and Eric A. Hansen, Department of Computer Science and Engineering, Mississippi State University during the 15th International Conference… … Wikipedia
Depth-First Search — Tiefensuche Tiefensuche (Depth First Search) ist in der Informatik ein Verfahren zum Suchen eines Knotens in einem Graphen. Sie zählt zu den uninformierten Suchalgorithmen. Eine Verbesserung der Tiefensuche ist die iterative Tiefensuche.… … Deutsch Wikipedia
Brute-force search — In computer science, brute force search or exhaustive search, also known as generate and test, is a trivial but very general problem solving technique that consists of systematically enumerating all possible candidates for the solution and… … Wikipedia
Line search — In (unconstrained) optimization, the line search strategy is one of two basic iterative approaches to finding a local minimum mathbf{x}^* of an objective function f:mathbb R^n omathbb R. The other method is that of trust regions.… … Wikipedia
depth-first search — noun an algorithm for traversing a tree or graph where one starts at the root nad explores as far as possible along each branch before backtracking … Wiktionary
Algorithmics of sudoku — The class of Sudoku puzzles consists of a partially completed row column grid of cells partitioned into N regions or zones each of size N cells, to be filled in using a prescribed set of N distinct symbols (typically the numbers {1, ..., N }), so … Wikipedia
Eight queens puzzle — a b c d e f g h … Wikipedia